Quantum Gates and Clifford Algebras

نویسنده

  • Alexander Yu
چکیده

Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical properties of the algebras those also justifies such applications. First, any complex Clifford algebra with 2n generators, Cll(2n, C), has representation as algebra of all 2 n × 2 n complex matrices and so includes unitary matrix of any quantum n-gate. An arbitrary element of whole algebra corresponds to general form of linear complex transformation. The last property is also useful because linear operators are not necessary should be unitary if they used for description of restriction of some unitary operator to subspace. The second advantage is simple algebraic structure of Cll(2n) that can be expressed via tenzor product of standard " building units " and similar with behavior of composite quantum systems. The compact notation with 2n generators also can be used in software for modeling of simple quantum circuits by modern conventional computers. The standard blocks may be based on three classical groups: 2 × 2 complex and real unimodular matrices and group of Weyl spinors, SU (2). The last group may have more close relation with nonrela-tivistic quantum systems as spinor representation of group of 3D rotations , SO(3). The second one, SL(2, IR), is widely used for theory of quantum error correction codes [1] together with a complexification, the first group SL(2, C) of Pauli spinors. More exactly, they are based on group algebras: C(2×2), IR(2×2) and H, i.e. all 2 × 2 complex and real matrices and quaternions respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebras and universal quantum computations with higher dimensional systems

Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and dis...

متن کامل

Semi-Clifford and Generalized Semi-Clifford Operations

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...

متن کامل

Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.

We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...

متن کامل

Derivations on Certain Semigroup Algebras

In the present paper we give a partially negative answer to a conjecture of Ghahramani, Runde and Willis. We also discuss the derivation problem for both foundation semigroup algebras and Clifford semigroup algebras. In particular, we prove that if S is a topological Clifford semigroup for which Es is finite, then H1(M(S),M(S))={0}.

متن کامل

C[subscript 3], semi-clifford and generalized semi-clifford operations Citation

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999